An anytime approach for on-line planning
نویسندگان
چکیده
In this paper we present a novel planning approach, based on well-known techniques such as goal decomposition and heuristic planning, aimed at working in highly dynamic environments with time constraints. Our contribution is a domainindependent planner to incrementally generate plans under a deliberative framework for reactive domains. The planner follows the anytime principles, i.e a first solution plan can be quickly computed and the quality of the solution is improved as time is available. Moreover, the fast computation of the sequential actions allows the plan to start its execution before it is totally generated, thus giving rise to a highly reactive planning system.
منابع مشابه
An On-Line Approach for Planning in Time-Limited Situations
In this paper we present a novel planning approach, based on wellknown techniques such as goal decomposition and heuristic planning, aimed at working in highly dynamic environments with time constraints. Our contribution is a domain-independent planner to incrementally generate plans under a deliberative framework for reactive domains. The planner follows the anytime principles, i.e a first sol...
متن کاملAnytime versus Real-Time Heuristic Search for On-Line Planning
Many AI systems, such as robots, must plan under time constraints. The most popular search approach in robotics so far is anytime search (Likhachev and Ferguson 2009), in which the algorithm quickly finds a suboptimal plan, and then continues to find better plans as time passes, until eventually converging on an optimal plan. However, the time until the first plan is returned is not controllabl...
متن کاملA Decision-Theoretic Planning Approach to Synthesizing High-Quality Contract Anytime Algorithms
In this paper, we develop a decision-theoretic planning approach to synthesizing high-quality contract anytime algorithms. Anytime algorithms are considered as time-parameterized probabilistic actions. Given a set of primitive anytime algorithms and their performance prooles, the problem of synthesizing high-quality anytime algorithms is translated to a decision-theoretic planning problem.
متن کاملEnhancing the Anytime Behaviour of Mixed CSP-Based Planning
An algorithm with the anytime property has an approximate solution always available; and the longer the algorithm runs, the better the solution becomes. Anytime planning is important in domains such as aerospace, where time for reasoning is limited and a viable (if suboptimal) course of action must be always available. In this paper we study anytime solving of a planning problem under uncertain...
متن کاملAnytime Dynamic A*: An Anytime, Replanning Algorithm
We present a graph-based planning and replanning algorithm able to produce bounded suboptimal solutions in an anytime fashion. Our algorithm tunes the quality of its solution based on available search time, at every step reusing previous search efforts. When updated information regarding the underlying graph is received, the algorithm incrementally repairs its previous solution. The result is a...
متن کامل